防振条约束失效对蒸汽发生器传热管面内流弹失稳的影响研究

根据防振条布置以及面内支承连续失效个数，将防振条面内约束失效分析划分为多种工况，分析了不同工况下面内约束失效对传热管面内模态的影响，采用各位置阻尼在振型函数上进行加权平均的方法计算了各阶模态的阻尼比，进而研究了防振条面内不同约束对传热管面内流弹失稳的影响。分析结果表明，随着面内支承连续失效位置的增多，弯管段面内首阶模态频率不断降低，出现在弯管段的振型越加明显；弯管段面内首阶模态不一定是最大流弹失稳比值出现的模态，最大流弹失稳比值出现模态的振型几乎都出现在弯管段；随着面内支承连续失效位置的增多，面内流弹失稳比值不断增大，当连续3个及以上防振条面内约束失效时，将出现流弹失稳现象。     

基于多线结构光的弱纹理物体形貌测量方法

大多数现有的主流结构光测量装置在被测物体的表面上投射单条激光,通过移动装置实现物体表面的扫描重建。为了实现物体表面的在线快速重建,将多线结构光和双目立体视觉理论相结合,设计了一种新的三维测量方法。提出了一种结合形态滤波和Zhang-Suen细化算法的光条骨架提取方法和基于光条序列关系的光条匹配算法,并通过极线约束实现光条上特征点的精确匹配。通过实验验证了方法的有效性,相对误差在3%以内。     

Optimal robust optimization approximation for chance constrained optimization problem

Chance constraints are useful for modeling solution reliability in optimization under uncertainty. In general, solving chance constrained optimization problems is challenging and the existing methods for solving a chance constrained optimization problem largely rely on solving an approximation problem. Among the various approximation methods, robust optimization can provide safe and tractable analytical approximation. In this paper, we address the question of what is the optimal (least conservative) robust optimization approximation for the chance constrained optimization problems. A novel algorithm is proposed to find the smallest possible uncertainty set size that leads to the optimal robust optimization approximation. The proposed method first identifies the maximum set size that leads to feasible robust optimization problems and then identifies the best set size that leads to the desired probability of constraint satisfaction. Effectiveness of the proposed algorithm is demonstrated through a portfolio optimization problem, a production planning and a process scheduling problem.     

Mathematical representation of radiality constraint in distribution system reconfiguration problem

Distribution systems are most commonly operated in a radial configuration for a number of reasons. In order to impose radiality constraint in the optimal network reconfiguration problem, an efficient algorithm is introduced in this paper based on graph theory. The paper shows that the normally followed methods of imposing radiality constraint within a mixed-integer programming formulation of the reconfiguration problem may not be sufficient. The minimum-loss network reconfiguration problem is formulated using different ways to impose radiality constraint. It is shown, through simulations, that the formulated problem using the proposed method for representing radiality constraint can be solved more efficiently, as opposed to the previously proposed formulations. This results in up to 30% reduction in CPU time for the test systems used in this study.     

Weighted Superposition Attraction (WSA): A swarm intelligence algorithm for optimization problems – Part 2: Constrained optimization

This paper is the second one of the two papers entitled “Weighted Superposition Attraction (WSA) Algorithm”, which is about the performance evaluation of the WSA algorithm in solving the constrained global optimization problems. For this purpose, the well-known mechanical design optimization problems, design of a tension/compression coil spring, design of a pressure vessel, design of a welded beam and design of a speed reducer, are selected as test problems. Since all these problems were formulated as constrained global optimization problems, WSA algorithm requires a constraint handling method for tackling them. For this purpose we have selected 6 formerly developed constraint handling methods for adapting into WSA algorithm and analyze the effect of the used constraint handling method on the performance of the WSA algorithm. In other words, we have the aim of producing concluding remarks over the performance and robustness of the WSA algorithm through a set of computational study in solving the constrained global optimization problems. Computational study indicates the robustness and the effectiveness of the WSA in terms of obtained results, reached level of convergence and the capability of coping with the problems of premature convergence, trapping in a local optima and stagnation.     

Adaptive control for switched uncertain nonlinear systems with time‐varying output constraint and input saturation

This paper is concerned with adaptive tracking control for switched uncertain nonlinear systems, which contain the time‐varying output constraint (TVOC) and input asymmetric saturation characteristic. In response to the unknown functions, the fuzzy logic systems are adopted. The controller is constructed by the backstepping technique. Based on the Tangent Barrier Lyapunov Function (BLF‐Tan), an adaptive switched control scheme is designed. It is demonstrated that all signals in the resulted system are semiglobally uniformly ultimately bounded with TVOC under arbitrary switchings. Furthermore, the effectiveness of presented control method is validated via the simulation example.     

软件功能安全验证活动的应用

软件功能安全验证活动对提高安全关键系统的安全性具有重要作用,它贯穿于软件安全生命周期的各个阶段。通过对各阶段输出文档的审查和分析,可尽早发现软件问题,降低软件修复成本。完整的问题闭环处理流程可有效解决软件验证活动中发现的问题,给出各方均满意的处理结果。     

The constrained two-dimensional guillotine cutting problem with defects: an ILP formulation,a Benders decomposition and a CP-based algorithm

This paper addresses a variant of two-dimensional cutting problems in which rectangular small pieces are obtained by cutting a rectangular object through guillotine cuts. The characteristics of this variant are (i) the object contains some defects, and the items cut must be defective-free; (ii) there is an upper bound on the number of times an item type may appear in the cutting pattern; (iii) the number of guillotine stages is not restricted. This problem commonly arises in industrial settings that deal with defective materials, e.g. either by intrinsic characteristics of the object as in the cutting of wooden boards with knotholes in the wood industry, or by the manufacturing process as in the production of flat glass in the glass industry. We propose a compact integer linear programming (ILP) model for this problem based on the discretisation of the defective object. As solution methods for the problem, we develop a Benders decomposition algorithm and a constraint-programming (CP) based algorithm. We evaluate these approaches through computational experiments, using benchmark instances from the literature. The results show that the methods are effective on different types of instances and can find optimal solutions even for instances with dimensions close to real-size.     

Model reduction for nonlinear multiscale parabolic problems using dynamic mode decomposition

In this article, a model reduction technique is presented to solve nonlinear multiscale parabolic problems using dynamic mode decomposition. The multiple scales and nonlinearity bring great challenges for simulating the problems. To overcome this difficulty, we develop a model reduction method for the nonlinear multiscale dynamic problems by integrating constraint energy minimizing generalized multiscale finite element method (CEM-GMsFEM) with dynamic mode decomposition (DMD). CEM-GMsFEM has shown great efficiency to solve linear multiscale problems in a coarse space. However, using CEM-GMsFEM to directly solve multiscale nonlinear parabolic models involves dynamically computing the residual and the Jacobian on a fine grid. This may be very computationally expensive because the evaluation of the nonlinear term is implemented in a high-dimensional fine scale space. As a data-driven method, DMD can use observation data and give an explicit expression to accurately describe the underlying nonlinear dynamic system. To efficiently compute the multiscale nonlinear parabolic problems, we propose a CEM-DMD model reduction by combing CEM-GMsFEM and DMD. The CEM-DMD reduced model is a coarsen linear model, which avoids the nonlinear solver in the fine space. It is crucial to judiciously choose observation in DMD. Only proper observation can render an accurate DMD model. In the context of CEM-DMD, we introduce two different observations: fine scale observation and coarse scale observation. In the construction of DMD model, the coarse scale observation requires much less computation than the fine scale observation. The CEM-DMD model using the coarse scale observation gives a complete coarse model for the nonlinear multiscale dynamic systems and significantly improves the computation efficiency. To show the performance of the CEM-DMD using the different observations, we present a few numerical results for the nonlinear multiscale parabolic problems in heterogeneous porous media.     

基于重要度排序的配电自动化终端优化布局方法

针对配电自动化终端优化布局问题，提出了一种基于重要度排序的终端优化布局方法。首先以等年值综合费用为目标函数，供电可靠性和投入产出比为双重约束建立了配电自动化终端优化布局模型。然后通过分析配电自动化终端对供电可靠性提升的影响，给出各个节点的“二遥”及“三遥”终端安装重要度定义及计算公式。最后采用枚举法确定最优终端安装数量，基于节点终端安装重要度排序确定终端的最优安装位置。该方法考虑了已布局节点对剩余节点终端安装重要度的影响，能够在降低计算量的同时兼顾布局合理性。运用所提方法RBTS-BUS2系统及扩充模型进行终端优化布局并与智能优化算法的布局结果进行对比，验证了本文方法的有效性及优越性。